Immunity Properties and the n-C.E. Hierarchy
نویسندگان
چکیده
We extend Post’s programme to finite levels of the Ershov hierarchy of ∆2 sets, and characterise, in the spirit of Post [9], the degrees of the immune and hyperimmune d.c.e. sets. We also show that no properly d.c.e. set can be hh-immune, and indicate how to generalise these results to n-c.e. sets, n > 2.
منابع مشابه
Asymptotic density and the Ershov hierarchy
We classify the asymptotic densities of the ∆2 sets according to their level in the Ershov hierarchy. In particular, it is shown that for n ≥ 2, a real r ∈ [0, 1] is the density of an n-c.e. set if and only if it is a difference of left-Π2 reals. Further, we show that the densities of the ω-c.e. sets coincide with the densities of the ∆2 sets, and there are ω-c.e. sets whose density is not the ...
متن کاملEquivalence structures and isomorphisms in the difference hierarchy
We examine the notion of structures and functions in the Ershov difference hierarchy, and of equivalence structures in particular. A equivalence structure A = (A,E) has universe A = ω and an equivalence relation E. The equivalence class [a] of a ∈ A is {b ∈ A : aEb} and the character K of A is {〈k, n〉 ∈ (ω − {0}) : A has at least n classes of size k}. It is known that for any character K, there...
متن کاملUniversal Cupping Degrees
Cupping nonzero computably enumerable (c.e. for short) degrees to 0′ in various structures has been one of the most important topics in the development of classical computability theory. An incomplete c.e. degree a is cuppable if there is an incomplete c.e. degree b such that a∪b = 0′, and noncuppable if there is no such degree b. Sacks splitting theorem shows the existence of cuppable degrees....
متن کاملA Survey of Results on the d-c.e. and n-c.e. Degrees
So a 1-c.e. set is simply a c.e. set, and a 2-c.e. set is a difference of two c.e. sets (also called a d.c.e. set). Putnam actually called the n-c.e. sets “n-trial and error predicates” (and did not require A0 = ∅). On the other hand, Gold [Go65], in a paper published in the same volume of the journal, defined “n-r.e.” to mean Σn (and is sometimes falsely credited with the above definition). Er...
متن کاملKolmogorov Complexity of Generalized Computably Enumerable Sets
The main purpose of this work is to characterize computably enumerable (c.e.) sets and generalized c.e. sets according to Kolmogorov complexity hierarchy. Given a set A, we consider A m, the initial segment of length m of the characteristic sequence of A. We show that the characteristic sequence of a 2 x-c.e. set can be random in the sense of Martin-LL of. We show that for x n-c.e. sets A, the ...
متن کامل